A note on regular Ramsey graphs
نویسندگان
چکیده
We prove that there is an absolute constant C > 0 so that for every natural n there exists a trianglefree regular graph with no independent set of size at least C √ n log n.
منابع مشابه
All Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملA note on the Ramsey number and the planar Ramsey number for C4 and complete graphs
We give a lower bound for the Ramsey number and the planar Ramsey number for C4 and complete graphs. We prove that the Ramsey number for C4 and K7 is 21 or 22. Moreover we prove that the planar Ramsey number for C4 and K6 is equal to 17.
متن کاملApplying Tabu Search to Determine New Ramsey Graphs
In this note an adaptation of heuristic tabu search algorithm for nding Ramsey graphs is presented. As a result, seven new lower bounds for classical Ramsey numbers are established:
متن کاملMinimum Degrees of Minimal Ramsey Graphs
For graphs F and H, we say F is Ramsey for H if every 2-coloring of the edges of F contains a monochromatic copy of H. The graph F is Ramsey H-minimal if there is no proper subgraph F ′ of F so that F ′ is Ramsey for H. Burr, Erdős, and Lovász defined s(H) to be the minimum degree of F over all Ramsey H-minimal graphs F . Define Ht,d to be a graph on t+ 1 vertices consisting of a complete graph...
متن کاملOn the minimum degree of minimal Ramsey graphs
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erdős, and Lovász. We determine the corresponding graph parameter for numerous bipartite graphs, including bi-regular bipartite graphs and forests. We also make initial progress for graphs of larger chromatic number. Numerous interesting problems remain open.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 64 شماره
صفحات -
تاریخ انتشار 2010